A note on packing of graphic n-tuples
نویسندگان
چکیده
منابع مشابه
Packing of graphic n-tuples
An n-tuple π (not necessarily monotone) is graphic if there is a simple graph G with vertex set {v1, . . . , vn} in which the degree of vi is the ith entry of π. Graphic n-tuples (d (1) 1 , . . . , d (1) n ) and (d (2) 1 , . . . , d (2) n ) pack if there are edge-disjoint n-vertex graphs G1 and G2 such that dG1(vi) = d (1) i and dG2(vi) = d (2) i for all i. We prove that graphic n-tuples π1 and...
متن کاملOrbits on n-tuples
A transitive (infinite) permutation group which has m orbits on ordered pairs of distinct points has at least mn−1 orbits on ordered n-tuples. This is best possible, and groups attaining the bound can be characterised.
متن کاملPacking of Graphic Sequences
Let π1 and π2 be graphic n-tuples, with π1 = (d (1) 1 , . . . , d (1) n ) and π2 = (d (2) 1 , . . . , d (2) n ) (they need not be monotone). We say that π1 and π2 pack if there exist edge-disjoint graphs G1 and G2 with vertex set {v1, . . . , vn} such that the degrees of vi in G1 and G2 are d (1) i and d (2) i , respectively. We prove that two graphic n-tuples pack if ∆ ≤ √ 2δn− (δ−1), where ∆ ...
متن کاملA note on packing connectorsJ
Given an undirected graph G = (V; E) and a partition fS; T g of V , an S{T connector is a set of edges F E such that every component of the subgraph (V; F) intersects both S and T. We show that G has k edge-disjoint S{T connectors if and only if j G (V 1) : : : G (V t)j kt for every collection fV 1 ; : : : ; V t g of disjoint nonempty subsets of S and for every such collection of subsets of T. ...
متن کاملNote : Anote on circle packing ∗
The problem of packing circles into a domain of prescribed topology is considered. The circles need not have equal radii. The Collins-Stephenson algorithm computes such a circle packing. This algorithm is parallelized in two different ways and its performance is reported for a triangular, planar domain test case. The implementation uses the highly parallel graphics processing unit (GPU) on comm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.07.017